Quantum Complexity: Some Recent Results, Some Open Problems, Some Thoughts
نویسنده
چکیده
This talk will discuss some recent results on the complexity theory of quantum computing. The long term goal is to understand exactly the relationship between the new quantum complexity classes and the classic ones. It is assumed that you are not an expert in: quantum flavordynamics, quantum geometrodynamics, quantum hydrodynamics, quantum magnetodynamics, quantum triviality, Schrödinger’s equation, path integral, Schwinger-Dyson equation, static forces and virtual-particle exchange, and the Ward-Takahashi identity. It is assumed that you are interested in hearing some simple ideas that connect basic complexity theory with quantum computation. No previous knowledge is assumed, all will be explained, at least that is the plan of the talk. M. Ogihara and J. Tarui (Eds.): TAMC 2011, LNCS 6648, p. 171, 2011. c © Springer-Verlag Berlin Heidelberg 2011
منابع مشابه
Lower Bounds for Query Complexity of Some Graph and Matrix Problems
The paper [4] by H.Buhrman and R. de Wolf contains an impressive survey of solved and open problems in quantum query complexity, including many graph problems. We use recent results by A.Ambainis [1] to prove higher lower bounds for some of these problems. Some of our new lower bounds do not close the gap between the best upper and lower bounds. We prove in these cases that it is impossible to ...
متن کاملSome recent global stability results for higher order difference equations ∗
We give a brief overview of some recent results for the global asymptotic stability of a difference equation xn+1 = f(n, xn, . . . , xn−k), n ≥ 0, assuming that the zero solution is the unique equilibrium. Different techniques are used, involving the use of new discrete inequalities, monotonicity arguments, and delay perturbation methods. For the particular case of linear autonomous difference ...
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملInfluence of Bidel's mystical thoughts on the construction of specific compounds
In his poetic and prose works, Bidel talks about both mystical views and his mystical experiences and adherence to the teachings of mysticism. At the level of the language of Bidel's poetry and prose, there are several factors in complexity. One of the complexities of language is the existence of "special compounds." In this paper, we examine and analyze how Bidel's mystical thoughts influence ...
متن کاملQuantum Algorithms for Matrix Multiplication
This talk will describe recent progresses in the development of quantum algorithms for matrix multiplication. I will start with the case of Boolean matrices, and discuss the time complexity and query complexity of Boolean matrix multiplication in the quantum setting. I will then focus on other kinds of matrix products, in particular matrix products over algebraic structures known as semirings (...
متن کامل